Circular Nim Games
نویسندگان
چکیده
A circular Nim game is a two player impartial combinatorial game consisting of n stacks of tokens placed in a circle. A move consists of choosing k consecutive stacks, and taking at least one token from one or more of the k stacks. The last player able to make a move wins. We prove results on the structure of the losing positions for small n and k and pose some open questions for further investigations.
منابع مشابه
On tame, pet, miserable, and strongly miserable impartial games
We consider tame impartial games and develop the Sprague-Grundy theory for misère playing the sum of such games that looks simpler than the classical theory suggested by Conway in 1976, which is based on the concept of genus. An impartial game is called pet if the sets of P-positions of its normal and misère versions are disjoint. We provide several equivalent characterizations and show that th...
متن کاملA PSPACE-complete Graph Nim
We build off the game, NimG [7] to create a version named Neighboring Nim. By reducing from Geography, we show that this game is PSPACE-hard. The games created by the reduction share strong similarities with Undirected (Vertex) Geography and regular Nim, both of which are solvable in polynomial-time. We show how to construct PSPACE-complete versions with nim heaps ∗1 and ∗2. This application of...
متن کاملCofinite Induced Subgraphs of Impartial Combinatorial Games: An Analysis of CIS-Nim
Given an impartial combinatorial game G, we create a class of related games (CISG) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such modifications amount to taking cofinite induced subgraphs (CIS) of the original game graph. Some recent numerical/heuristic work has suggested that the underlying struc...
متن کاملSome Remarks on End-Nim
We reexamine Albert and Nowakowski’s variation on the game of Nim, called End-Nim, in which the players may only remove coins from the leftmost or rightmost piles. We reformulate Albert and Nowakowski’s solution to this game. We examine its misère version and a further variant where the winner is the player who reduces the game to a single pile; we call this Loop-End-Nim. We show that the three...
متن کاملEvolving Winning Strategies for Nim-like Games
An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. The winning strategy is computed by using the Multi Expression Programming (MEP) technique a fast and efficient variant of the Genetic Programming (GP). Each play strategy is represented by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and , or, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013